Ranking Users in Social Networks with Motif-based PageRank
نویسندگان
چکیده
منابع مشابه
Ranking Users in Social Networks with Higher-Order Structures
PageRank has been widely used to measure the authority or the influence of a user in social networks. However, conventional PageRank only makes use of edge-based relations, ignoring higher-order structures captured by motifs, subgraphs consisting of a small number of nodes in complex networks. In this paper, we propose a novel framework, motif-based PageRank (MPR), to incorporate higher-order s...
متن کاملIdentifying Key Users in Online Social Networks: A PageRank Based Approach
Online social networks evolved into a global mainstream medium that generates an increasing social and economic impact. However, many online social networks face the question how to leverage on their fast growing popularity to achieve sustainable revenues. In that context, particularly more effective advertising strategies and sophisticated customer loyalty programs to foster users’ retention a...
متن کاملLocation-Based Social Networks: Users
In this chapter, we introduce and define the meaning of location-based social network (LBSN) and discuss the research philosophy behind LBSNs from the perspective of users and locations. Under the circumstances of trajectory-centric LBSN, we then explore two fundamental research points concerned with understanding users in terms of their locations. One is modeling the location history of an ind...
متن کاملFinding Important Nodes in Social Networks Based on Modified Pagerank
Important nodes are individuals who have huge influence on social network. Finding important nodes in social networks is of great significance for research on the structure of the social networks. Based on the core idea of Pagerank, a new ranking method is proposed by considering the link similarity between the nodes. The key concept of the method is the use of the link vector which records the...
متن کاملPersonalizing PageRank-Based Ranking over Distributed Collections
In distributed work environments, where users are sharing and searching resources, ensuring an appropriate ranking at remote peers is a key problem. While this issue has been investigated for federated libraries, where the exchange of collection specific information suffices to enable homogeneous TFxIDF rankings across the participating collections, no solutions are known for PageRank-based ran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2020
ISSN: 1041-4347,1558-2191,2326-3865
DOI: 10.1109/tkde.2019.2953264